Optimizing Ship Speed to Minimize Total Fuel Consumption with Multiple Time Windows
نویسندگان
چکیده
منابع مشابه
Vehicle Routing Problem with Time Windows for Reducing Fuel Consumption
Most of the studies on vehicle routing problem with time windows (VRPTW) aim to minimize total travel distance or travel time. This paper presents the VRPTW with a new objective function of minimizing the total fuel consumption. A mathematical model is proposed to formulate this problem. Then, a novel tabu search algorithm with a random variable neighborhood descent procedure (RVND) is given, w...
متن کاملRouting vehicles to minimize fuel consumption
We consider a generalization of the capacitated vehicle routing problem known as the cumulative vehicle routing problem in the literature. Cumulative VRPs are known be a simple model for fuel consumption in VRPs. We examine four variants of the problem, and give constant factor approximation algorithms. Our results are based on a well-known heuristic of partitioning the traveling salesman tours...
متن کاملHeuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows
We present heuristics to handle practical travelling salesman problems with multiple time windows per node, where the optimization goal is minimal tour duration, which is the time spent outside the depot node. We propose a dynamic programming approach which combines state labels by encoding intervals to handle the larger state space needed for this objective function. Our implementation is able...
متن کاملShip Trim Optimization for the Reduction of Fuel Consumption
Greenhouse gas emissions and atmospheric pollutants, economic savings, as well as alignment with the new rules of the shipping industry's leading is a new concern. In order to meet and achieve these goals, many efforts have been made. In this paper, some methods for reducing fuel consumption, including optimization of floating trim, have been considered in design draught. In this regard, the bo...
متن کاملScheduling with Rejection to Minimize the Total Weighted Completion Time∗
In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted completion time with the constraint of total penalties on identical parallel machines, where the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/3130291